منابع مشابه
Interaction Combinators
It is shown that a very simple system of interaction com-binators, with only 3 symbols and 6 rules, is a universal model of distributed computation, in a sense that will be made precise. This paper is the continuation of the au-thor's work on interaction nets, inspired by Girard's proof nets for linear logic, but no preliminary knowledge of these topics is required for its reading.
متن کاملCombinators for Interaction Nets
The completeness property of SK combinators is well known. We consider an analogous property in the context of Lafont's Interaction Nets, a graph rewriting system based on classical linear logic. The result is a set of combinators which is complete in the sense of being able to encode all possible patterns of interaction.
متن کاملEncoding Linear Logic with Interaction Combinators
ion. If is an abstraction , then is given by the following net:
متن کاملToken Machines for Multiport Interaction Combinators
Game semantics [7, 1] and the Geometry of Interaction [6] are semantic frameworks centered around the dynamic, interactive behaviour of the interpreted object rather than on its static, extensional properties. The obtained semantics is often fully abstract, and its concreteness can be exploited in the definition of compilation schemes towards low-level languages, like in the Geometry of Synthes...
متن کاملCompiling the -calculus into Interaction Combinators
In this paper we present a case study of the use of Lafont's interaction combinators for the coding of the -calculus. We obtain a very simple, perhaps the simplest, system of rewriting which performs very well in comparison with extant interaction net implementations for the -calculus. The coding is shown to be correct, and we give a series of experimental results using a prototype implementation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1997
ISSN: 0890-5401
DOI: 10.1006/inco.1997.2643